Computation of Modifier Scope in NP by a Language-neutral Method
نویسنده
چکیده
The relative logical scope of multiple modifiers within NP is often semantically significant. This paper proposes a structurally based method for computing the relative scope of such modifiers, based on their order, type, and syntactic complexity. The algorithm is language-neutral, in that it works with minimal errors for a wide range of languages without language-specific stipulations.
منابع مشابه
Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملThe Principle of Relativity: From Ungar’s Gyrolanguage for Physics to Weaving Computation in Mathematics
This paper extends the scope of algebraic computation based on a non standard $times$ to the more basic case of a non standard $+$, where standard means associative and commutative. Two physically meaningful examples of a non standard $+$ are provided by the observation of motion in Special Relativity, from either outside (3D) or inside (2D or more), We revisit the ``gyro''-theory ...
متن کاملStudy on Electrochemical Oxidation of m-Nitrophenol on Various Electrodes Using Cyclic Voltammetry
The electrochemical oxidation behavior of m-nitrophenol (m-NP) was studied comparatively on glassy carbon electrode, Pt electrode, PbO2 electrode, SnO2 electrode, and graphite electrode using cyclic voltammetry. The cyclic voltammetry measurements were performed in acidic (1 M H2SO4, pH 0.4), neutral (1 M Na2SO4, pH 6.8), and...
متن کاملSupport Vector Machines Applied To The Classification Of Semantic Relations In Nominalized Noun Phrases
The discovery of semantic relations in text plays an important role in many NLP applications. This paper presents a method for the automatic classification of semantic relations in nominalized noun phrases. Nominalizations represent a subclass of NP constructions in which either the head or the modifier noun is derived from a verb while the other noun is an argument of this verb. Especially des...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کامل